Utility Optimization in Congested Queueing Networks

نویسنده

  • N. S. Walton
چکیده

We consider a multi-class single server queueing network as a model of a packet switching network. The rates packets are sent into this network are controlled by queues which act as congestion windows. By considering a sequence of such congestion windows we allow the network to become congested. We show the stationary throughput of routes on this sequence of networks converges to an allocation that maximizes aggregate utility subject to the network’s capacity constraints. To perform this analysis we require that our utility functions satisfy an exponential concavity condition. This family of utilities includes weighted α-fair utilities for α > 1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Hierarchical Location-Allocation Models for Congested Systems

There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...

متن کامل

A surrogate model for traffic optimization of congested networks: an analytic queueing network approach

Congested networks involve complex traffic dynamics that can be accurately captured with detailed simulation models. However, when performing optimization of such networks the use of simulators is limited due to their stochastic nature and their relatively high evaluation cost. This has lead to the use of general-purpose analytical metamodels, that are cheaper to evaluate and easier to integrat...

متن کامل

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

متن کامل

A simulation optimization framework for the management of congested urban road networks

Deriving optimal traffic management schemes for urban road networks typically relies on the use of complex simulation tools, that capture in detail the behavior of drivers as well as their interaction with the network infrastructure. The integration of these traffic simulators within an optimization framework is an intricate task. Indeed, these simulators can be seen as stochastic nonlinear fun...

متن کامل

Insensitive, maximum stable allocations converge to proportional fairness

We describe a queueing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queueing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a propo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009